Explicit Computation of Padé–Hermite Approximants
نویسندگان
چکیده
منابع مشابه
Effective Computation of Rational Approximants and Interpolants
This paper considers the problem of effective algorithms for some problems having structured coefficient matrices. Examples of such problems include rational approximation and rational interpolation. The corresponding coefficient matrices include Hankel, Toeplitz and Vandermonde-like matrices. Effective implies that the algorithms studied are suitable for implementation in either a numeric envi...
متن کاملExplicit computation of the Chern character forms
We propose a method for explicit computation of the Chern character form of a holomorphic Hermitian vector bundle (E, h) over a complex manifold X in a local holomorphic frame. First, we use the descent equations arising in the double complex of (p, q)-forms on X and find the explicit degree decomposition of the Chern–Simons form csk associated to the Chern character form chk of (E, h). Second,...
متن کاملExplicit construction of general multivariate Padé approximants to an Appell function
a Department of Mathematics and Statistics, Simon Fraser University, Burnaby, BC, Canada V5B 1S6 E-mail: [email protected] b Department of Mathematics and Computer Science, University of Antwerp, Middelheimlaan 1, B-2020 Antwerp, Belgium E-mail: [email protected] c Department of Mathematics, Statistics and Computer Science, St. Francis Xavier University, Antigonish, NS, Canada B2G 2W5 E-mail...
متن کاملthe effect of explicit teaching of metacognitive vocabulary learning strategies on recall and retention of idioms
چکیده ندارد.
15 صفحه اولFast Solution of Toeplitz Systems of Equations and Computation of Padé Approximants
We present two new algorithms, ADT and MDT, for solving order-n Toeplitz systems of linear equations Tz = b in time O(n log n) and space O(n). The fastest algorithms previously known, such as Trench’s algorithm, require time Ω(n2) and require that all principal submatrices of T be nonsingular. Our algorithm ADT requires only that T be nonsingular. Both our algorithms for Toeplitz systems are de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1997
ISSN: 0021-9045
DOI: 10.1006/jath.1996.3009